On the choice number of claw-free perfect graphs
نویسندگان
چکیده
We prove that every 3-chromatic claw-free perfect graph is 3-choosable. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Claw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw-free circular-perfect graphs. First we prove that ifG is a connected claw-free circular-perfect graph with χ(G) > ω(G), then min{α(G), ω(G)} = 2. We use this resu...
متن کاملThe Structure of Claw-Free Perfect Graphs
In 1988, Chvátal and Sbihi [4] proved a decomposition theorem for claw-free perfect graphs. They showed that claw-free perfect graphs either have a clique-cutset or come from two basic classes of graphs called elementary and peculiar graphs. In 1999, Maffray and Reed [6] successfully described how elementary graphs can be built using line-graphs of bipartite graphs using local augmentation. How...
متن کاملInteger round-up property for the chromatic number of some h-perfect graphs
A graph is h-perfect if its stable set polytope can be completely described by nonnegativity, clique and odd-hole constraints. It is t-perfect if it furthermore has no clique of size 4. For every graph G and every c ∈ Z (G) + , the weighted chromatic number of (G, c) is the minimum cardinality of a multi-set F of stable sets of G such that every v ∈ V (G) belongs to at least cv members of F . W...
متن کاملClaw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures
Strongly perfect graphs have been studied by several authors (e.g., Berge andDuchet (1984) [1], Ravindra (1984) [7] and Wang (2006) [8]). In a series of two papers, the current paper being the second one, we investigate a fractional relaxation of strong perfection. Motivated by a wireless networking problem, we consider claw-free graphs that are fractionally strongly perfect in the complement. ...
متن کاملOn claw-free t-perfect graphs
A graph is called t-perfect, if its stable set polytope is defined by nonnegativity, edge and odd-cycle inequalities. We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 276 شماره
صفحات -
تاریخ انتشار 2004